Discovering Research Hypotheses in Social Science Using Knowledge Graph Embeddings

نویسندگان

چکیده

In an era of ever-increasing scientific publications available, scientists struggle to keep pace with the literature, interpret research results and identify new hypotheses falsify. This is particularly in fields such as social sciences, where automated support for discovery still widely unavailable unimplemented. this work, we introduce system that supports identifying hypotheses. With idea knowledge graphs help modeling domain-specific information, machine learning can be used most relevant facts therein, frame problem hypothesis a link prediction task, ComplEx model predict relationships between entities graph representing papers their experimental details. The final output consists fully formulated including newly discovered triples (hypothesis statement), along supporting statements from evidence history). A quantitative qualitative evaluation carried using experts field. Encouraging show simple combination methods serve basis discovery.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convolutional 2D Knowledge Graph Embeddings

Link prediction for knowledge graphs is the task of predicting missing relationships between entities. Previous work on link prediction has focused on shallow, fast models which can scale to large knowledge graphs. However, these models learn less expressive features than deep, multi-layer models – which potentially limits performance. In this work we introduce ConvE, a multi-layer convolutiona...

متن کامل

Inducing Interpretability in Knowledge Graph Embeddings

We study the problem of inducing interpretability in KG embeddings. Specifically, we explore the Universal Schema (Riedel et al., 2013) and propose a method to induce interpretability. There have been many vector space models proposed for the problem, however, most of these methods don’t address the interpretability (semantics) of individual dimensions. In this work, we study this problem and p...

متن کامل

Mechanisms and Functional Hypotheses in Social Science

Critics of functional explanations in social science maintain that such explanations are illegitimate unless a mechanism is specified. Others argue that mechanisms are not necessary for causal inference and that functional explanations are a type of causal claim that raise no special difficulties for testing. I show that there is indeed a special problem that confronts testing functional explan...

متن کامل

Fast Linear Model for Knowledge Graph Embeddings

This paper shows that a simple baseline based on a Bag-of-Words (BoW) representation learns surprisingly good knowledge graph embeddings. By casting knowledge base completion and question answering as supervised classification problems, we observe that modeling co-occurences of entities and relations leads to state-of-the-art performance with a training time of a few minutes using the open sour...

متن کامل

Expeditious Generation of Knowledge Graph Embeddings

Knowledge Graph Embedding methods aim at representing entities and relations in a knowledge base as points or vectors in a continuous vector space. Several approaches using embeddings have shown promising results on tasks such as link prediction, entity recommendation, question answering, and triplet classification. However, only a few methods can compute low-dimensional embeddings of very larg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-77385-4_28